The square lattice shuffle, correction

نویسنده

  • Johan Håstad
چکیده

1. A CORRECTION Theorem 3.6 in [1] contains an error in the stated bound. As is argued above the theorem, the statistical distance to the uniform distribution decreases by a factor O ( (m/ log m)−1/2 ) = O ((log n)1/2n−1/4) for every two iterations. This implies that the bound obtained for Theorem 3.6 should read O ( n1− t−1 2 1 4 (log n) t−1 2 1 2 ) . I am grateful to Justin Holmgren for pointing out this correction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The square lattice shuffle

We show that the operations of permuting columns and rows separately and independently mix a square matrix in constant time.

متن کامل

Correction-to-Scaling Exponents for Two-Dimensional Self-Avoiding Walks

We study the correction-to-scaling exponents for the two-dimensional selfavoiding walk, using a combination of series-extrapolation and Monte Carlo methods. We enumerate all self-avoiding walks up to 59 steps on the square lattice, and up to 40 steps on the triangular lattice, measuring the mean-square end-to-end distance, the mean-square radius of gyration and the mean-square distance of a mon...

متن کامل

A short proof that shuffle squares are 7-avoidable

A shuffle square is a word that can be partitioned into two identical words. We obtain a short proof that there exist exponentially many words over the 7 letter alphabet containing no shuffle square as a factor. The method is a generalization of the so-called power series method using ideas of the entropy compression method as developped by Gonçalves, Montassier, and Pinlou. 1991 Mathematics Su...

متن کامل

Unshuffling Permutations

A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the problem of recognizing square permutations from both the point of view of algebra and algorithms. On the one hand, we present some algebraic and combinatorial p...

متن کامل

Unshuffling a Square is NP-Hard

A shuffle of two strings is formed by interleaving the characters into a new string, keeping the characters of each string in order. A string is a square if it is a shuffle of two identical strings. There is a known polynomial time dynamic programming algorithm to determine if a given string z is the shuffle of two given strings x, y; however, it has been an open question whether there is a pol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Random Struct. Algorithms

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2016